A Simplified Recombinant PSO
نویسندگان
چکیده
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding how a particle swarm optimization (PSO) swarm functions. One of these forms, PSO with discrete recombination, is extended and analyzed, demonstrating not just improvements in performance relative to a standard PSO algorithm, but also significantly different behavior, namely, a reduction in bursting patterns due to the removal of stochastic components from the update equations.
منابع مشابه
A Simplified Process for Purification and Refolding of Recombinant Human Interferon-α2b
Background: Interferon α-2b is a vital biotherapeutic produced through the recombinant DNA technology in E. coli. The recombinant IFN-α2b normally appears as intercellular IBs, which requires intensive refolding and purification steps. Method: Purification of IFN-α2b from solubilized IB was performed using two-phase extraction. To optimize refolding conditions, the effects of pH and different a...
متن کاملSimplifying Particle Swarm Optimization
The general purpose optimization method known as Particle Swarm Optimization (PSO) has received much attention in past years, with many attempts to find the variant that performs best on a wide variety of optimization problems. The focus of past research has been with making the PSO method more complex, as this is frequently believed to increase its adaptability to other optimization problems. ...
متن کاملIK-PSO, PSO Inverse Kinematics Solver with Application to Biped Gait Generation
This paper describes a new approach allowing the generation of a simplified Biped gait. This approach combines a classical dynamic modeling with an inverse kinematics’ solver based on particle swarm optimization, PSO. First, an inverted pendulum, IP, is used to obtain a simplified dynamic model of the robot and to compute the target position of a key point in biped locomotion, the Centre Of Mas...
متن کاملExamination of Particle Tails
The tail of the particle swarm optimisation (PSO) position distribution at stagnation is shown to be describable by a power law. This tail fattening is attributed to particle bursting on all length scales. The origin of the power law is concluded to lie in multiplicative randomness, previously encountered in the study of first-order stochastic difference equations, and generalised here to secon...
متن کاملA Simplified Particle Swarm Optimization for Job Scheduling in Cloud Computing
Recent advances in various areas such as networking, information and communication technologies have greatly boosted the potential capabilities of cloud computing and made it become more prevalent in recent years. Cloud computing is a promising computing paradigm that facilitates the delivery of IT infrastructure, platforms, and applications of any kind to consumers as services over the interne...
متن کامل